1950D - Product of Binary Decimals - CodeForces Solution

def check(n):
   l = [ 10, 11, 100, 101, 110, 111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111, 10000, 10001, 10010, 10011, 10100, 10101, 10110, 10111, 11000, 11001, 11010, 11011, 11100, 11101, 11110, 11111]
   k1 = str(n).count('0')
   k2 = str(n).count('1')
   if k1+k2 == len(str(n)):
           return 'YES'
   for i in l:
        if n%i == 0:
             if n//i in l:
                  return 'YES'
             else:
                  t = check(n//i)
                  if t == 'YES':
                      return 'YES'
                  else:
                       return 'NO'
   return 'NO'          
   



for i in range(int(input())):
  
   n = int(input())
   print(check(n))